Finite Energy Survey Propagation for Constraint Satisfaction Problems
نویسنده
چکیده
The Survey Propagation (SP) algorithm [1] has recently been shown to work well in the hard region for random K-SAT problems. SP has its origins in sophisticated arguments in statistical physics, and can be derived from an approach known as the cavity method, when applied at what is called the one-step replica symmetry breaking level. In its most general form, SP can be applied to general constraint satisfaction problems, and can also be used in the unsatisfiable region, where the aim is to minimize the number of violated constraints. In this paper, we formulate the SP-Y algorithm for general constraint satisfaction problems, applicable for minimizing the number of violated constraints. This could be useful, for example, in solving approximate subgraph isomorphism problems. Preliminary results show that SP can solve a few instances of induced subgraph isomorphism for which belief propagation failed to converge.
منابع مشابه
Survey Propagation: Iterative Solutions to Constraint Satisfaction Problems
Iterative algorithms, such as the well known Belief Propagation algorithm, have had much success in solving problems in statistical inference and coding and information theory. Survey Propagation attempts to apply iterative message passing algorithms to solve difficult combinatorial problems, in particular constraint satisfaction problems such as k-sat and coloring problems. Intuition from stat...
متن کاملThreshold Saturation in Spatially Coupled Constraint Satisfaction Problems
We consider chains of random constraint satisfaction models that are spatially coupled across a finite window along the chain direction. We investigate their phase diagram at zero temperature using the survey propagation formalism and the interpolation method. We prove that the SAT-UNSAT phase transition threshold of an infinite chain is identical to the one of the individual standard model, an...
متن کاملYedidia Message - passing Algorithms for Inference and Optimization : “ Belief Propagation ” and “ Divide and Concur ”
Message-passing algorithms can solve a wide variety of optimization, inference, and constraint satisfaction problems. The algorithms operate on factor graphs that visually represent the problems. After describing some of their applications, I survey the family of belief propagation (BP) algorithms, beginning with a detailed description of the min-sum algorithm and its exactness on tree factor g...
متن کاملPerturbed Message Passing for CSP Perturbed Message Passing for Constraint Satisfaction Problems
We introduce an efficient message passing scheme for solving Constraint Satisfaction Problems (CSPs), which uses stochastic perturbation of Belief Propagation (BP) and Survey Propagation (SP) messages to bypass decimation and directly produce a single satisfying assignment. Our first CSP solver, called Perturbed Belief Propagation, smoothly interpolates two well-known inference procedures; it s...
متن کاملBelief propagation algorithms for constraint satisfaction problems
Belief propagation algorithms for constraint satisfaction problems by Elitza Nikolaeva Maneva Doctor of Philosophy in Computer Science and the Designated Emphasis in Communication, Computation, and Statistics University of California, Berkeley Professor Alistair Sinclair, Chair We consider applications of belief propagation algorithms to Boolean constraint satisfaction problems (CSPs), such as ...
متن کامل